|
In theoretical computer science, stuttering equivalence, a relation written as :, can be seen as a partitioning of path and into blocks, so that states in the block of the other path. Corresponding blocks may have different lengths. Formally, this can be expressed as two infinite paths and which are stuttering equivalent () if there are two infinite sequences of integers and such that for every block holds . Stuttering equivalence is not the same as bisimulation, since bisimulation cannot capture the semantics of the 'eventually' (or 'finally') operator found in linear temporal/computation tree logic(branching time logic)(modal logic). So-called ''branching bisimulation'' has to be used. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Stuttering equivalence」の詳細全文を読む スポンサード リンク
|